Fast computation of Voigt functions via Fourier transforms
نویسندگان
چکیده
منابع مشابه
Fast Computation of Voigt Functions via Fourier Transforms
This work presents a method of computing Voigt functions and their derivatives, to high accuracy, on a uniform grid. It is based on an adaptation of Fourier-transform based convolution. The relative error of the result decreases as the fourth power of the computational effort. Because of its use of highly vectorizable operations for its core, it can be implemented very efficiently in scripting ...
متن کاملFast Computation of Partial Fourier Transforms
We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to decompose the summation domain of into simpler components in a multiscale way. Existing fast algorithms are then applied to each component to obtain optimal compl...
متن کاملComputation of Earthquake Response via Fourier Amplitude Spectra
A theoretical relation is presented between the seismological Fourier amplitude spectrumand the mean squared value of the elastic response, which is defined by Gaussian distribution. Byshifting a general process to its mean value, spectrum of the mean squared value of the displacementis computed from the Fourier amplitude spectrum and the real part of the relative displacementtransfer function ...
متن کاملFast Fourier Transforms
29 O(b log(b)) operations (using standard multiplication). As there are O(b= log(b)) primes in total, the running time of this stage of the algorithm is O(b 2 L), even using the \grammar school" method of integer multiplication. At this stage of the algorithm we have obtained a vector of length L whose entries are integral linear combinations of powers of with coeecients bounded by M in absolut...
متن کاملDimensionless Fast Fourier Transforms
This paper shows that there are fast Fourier transform (FFT) algorithms that work, for a fixed number of points, independent of the dimension. Changing the dimension is achieved by relabeling the input and the output and changing the “twiddle factors.” An important consequence of this result, is that a program designed to compute the 1-dimensional Fourier transform can be easily modified to com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Quantitative Spectroscopy and Radiative Transfer
سال: 2007
ISSN: 0022-4073
DOI: 10.1016/j.jqsrt.2006.11.014